Word-into-Trees Transducers with Bounded Di erence
نویسندگان
چکیده
Non-deleting Word-into-Trees Transducers with bounded difference are investigated in this paper. Informally, these transducers which produce trees from words have the property that the diierence of height of any couple of trees (the input tree being a word) is bounded. We establish the fact that the tree transformations induced by such transducers have some good closure properties.
منابع مشابه
Orr Sommerfeld Solver Using Mapped Finite Di?erence Scheme for Plane Wake Flow
Linear stability analysis of the three dimensional plane wake flow is performed using a mapped finite di?erence scheme in a domain which is doubly infinite in the cross–stream direction of wake flow. The physical domain in cross–stream direction is mapped to the computational domain using a cotangent mapping of the form y = ?cot(??). The Squire transformation [2], proposed by Squire, is also us...
متن کاملA Parallel Tree Di erence Algorithm
We present a tree di erence algorithm with expected sequential execution timeO(n log log n) and expected parallel execution time of O(log n), for trees of size n. The algorithm assumes unique labels and permits operations only on leaves and frontier subtrees. Despite these limitations, it can be useful in the analysis of structured text. 1 Applications of Tree Di erence In this paper we describ...
متن کاملiCLEF 2001 at Maryland: Comparing Word-for-Word Gloss and MT
For the rst interactive Cross-Language Evaluation Forum, the Maryland team focused on comparison of term-for-term gloss translation with full machine translation for the document selection task. The results show that (1) searchers are able to make relevance judgments with translations from either approach, and (2) the machine translation system achieved better e ectiveness than the gloss transl...
متن کاملC 5 . 1 . 3 Decision Tree Discovery
We describe the two most commonly used systems for induction of decision trees for classi cation: C4.5 and CART. We highlight the methods and di erent decisions made in each system with respect to splitting criteria, pruning, noise handling, and other di erentiating features. We describe how rules can be derived from decision trees and point to some di erence in the induction of regression tree...
متن کاملHierarchical Translation Equivalence over Word Alignments
We present a theory of word alignments in machine translation (MT) that equips every word alignment with a hierarchical representation with exact semantics defined over the translation equivalence relations known as hierarchical phrase pairs. The hierarchical representation consists of a set of synchronous trees (called Hierarchical Alignment Trees – HATs), each specifying a bilingual compositi...
متن کامل